Optimal Time to Exchange Two Baskets
نویسندگان
چکیده
منابع مشابه
Using Shopping Baskets to Cluster Supermarket Shoppers
Today, competition forces consumer goods manufacturers and retailers to differentiate from their competitors by specializing and by offering goods/services that are tailored towards one or more subgroups or segments of the market. Retailers understand that shoppers are heterogeneous in nature, that they possess different wants and needs and that it is impossible to satisfy them all. However, th...
متن کاملOptimal two-qubit quantum circuits using exchange interactions
We give the optimal decomposition of a universal two-qubit circuit using Heisenberg exchange interactions and single qubit rotations. Tuning the strength and duration of the Heisenberg exchange allows one to implement SWAP gates. Our optimal circuit is constructed from only three SWAP gates and six single qubit gates. We show that three SWAP gates are not only sufficient, but necessary. Since s...
متن کاملOptimal Deterministic Polynomial-Time Data Exchange for Omniscience
We study the problem of constructing a deterministic polynomial time algorithm that achieves omniscience, in a rate-optimal manner, among a set of users that are interested in a common file but each has only partial knowledge about it as side-information. Assuming that the collective information among all the users is sufficient to allow the reconstruction of the entire file, the goal is to min...
متن کاملTwo-stage time-optimal formation reconfiguration strategy
A time-optimal reconfiguration strategy for formation flying of autonomous acceleration-controlled agents is presented. In the proposed strategy, the agents are moved to a special designated formation in the time interval between the completion of the mission in the current formation and the issuance of the next reconfiguration command. It is shown that the problem of finding the special design...
متن کاملOptimal Two Stages Specially Structured Flow Shop Scheduling: Minimize the Rental Cost with Independent Setup Time
One of the earliest results in flow shop scheduling theory is an algorithm given by Johnson’s [1] for scheduling jobs on two or three machines to minimize the total elapsed time whenever the processing times of jobs are random. The present paper is an attempt to develop a heuristic algorithm for two stages specially structured flow shop scheduling in which the processing times of the jobs a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2011
ISSN: 0021-9002,1475-6072
DOI: 10.1017/s0021900200007609